Measurable Events Indexed by Trees
نویسندگان
چکیده
A tree T is said to be homogeneous if it is uniquely rooted and there exists an integer b > 2, called the branching number of T , such that every t ∈ T has exactly b immediate successors. We study the behavior of measurable events in probability spaces indexed by homogeneous trees. Precisely, we show that for every integer b > 2 and every integer n > 1 there exists an integer q(b, n) with the following property. If T is a homogeneous tree with branching number b and {At : t ∈ T} is a family of measurable events in a probability space (Ω,Σ, μ) satisfying μ(At) > ε > 0 for every t ∈ T , then for every 0 < θ < ε there exists a strong subtree S of T of infinite height such that for every non-empty finite subset F of S of cardinality n we have μ ( ⋂ t∈F At ) > θ. In fact, we can take q(b, n) = ( (2 − 1)2n−1 − 1 ) · (2 − 2)−1. A finite version of this result is also obtained.
منابع مشابه
Measurable events indexed by products of trees
A tree T is said to be homogeneous if it is uniquely rooted and there exists an integer b > 2, called the branching number of T , such that every t ∈ T has exactly b immediate successors. A vector homogeneous tree T is a finite sequence (T1, ..., Td) of homogeneous trees and its level product ⊗T is the subset of the cartesian product T1 × ...× Td consisting of all finite sequences (t1, ..., td)...
متن کاملMeasurable events indexed by words
For every integer k > 2 let [k] 1 is a subset of [k]<N of the form {w} ∪ { ww0(a0) ...wn(an) : n ∈ {0, ...,m− 1} and a0, ..., an ∈ [k] } where w is a word over k and (wn) m−1 n=0 is a finite sequence of left variable words over k. We study the behavior of a family of measurable events in a probability space index...
متن کاملEfficient Range Minimum Queries using Binary Indexed Trees
We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using the Binary Indexed Trees so that we can answer different types of queries, e.g. the range minimum query, in O (log N ) time complexity per operation, outperforming in speed similar data structures like Segment/Range Trees or the Sparse Table Algorithm.
متن کاملبررسی مدارک علمی نمایه شده ایران در پایگاه مدلاین در زمینه بایومارکرها در سال های 2000 تا 2011
Background and purpose: Biomarkers are measurable characteristic that reflect the severity or the presence of some diseases states. It can be used to examine organ function and other aspects of health states. The objective of the current study was to analyze the trend of scientific production originated by Iranian authors. Material and methods: Scientometrics and economic indicators were used ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 21 شماره
صفحات -
تاریخ انتشار 2012